Relaxed verification for continuous problems
نویسندگان
چکیده
منابع مشابه
Relaxed verification for continuous problems
We analyze the complexity of verifying whether a given element is close to a solution element. Closeness is measured by two nonnegative parameters, " and. If = 0, then we get the strong veriication problem which usually cannot be solved in the worst case setting, see Wo zniakowski 90]. For > 0, we have the relaxed veriication problem which is studied in this paper in the worst case setting. We ...
متن کاملEffective Program Verification for Relaxed Memory Models
Program verification for relaxed memory models is hard. The highdegree of nondeterminism in such models challenges standard ver-ification techniques. This paper proposes a new verification tech-nique for the most common relaxation, store buffers. Crucial tothis technique is the observation that all programmers, includingthose who use low-lock techniques for performance, expe...
متن کاملVerification of Software under Relaxed Memory
Leonardsson, C. 2016. Verification of Software under Relaxed Memory. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1387. 102 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9616-6. The work covered in this thesis concerns automatic analysis of correctness of parallel programs running under relaxed memory models. When a parallel ...
متن کاملCompositional Verification of Relaxed-Memory Program Transformations
is paper is about verifying program transformations on an axiomatic relaxed memory model of the kind used in C/C++ and Java. Relaxed models present particular challenges for verifying program transformations, because they generate many additional modes of interaction between code and context. For a block of code being transformed, we dene a denotation from its behaviour in a set of representa...
متن کاملVerification of STM on relaxed memory models
Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1992
ISSN: 0885-064X
DOI: 10.1016/0885-064x(92)90012-z